The common solution of twelve matrix equations over the quaternions
نویسندگان
چکیده
In this paper, we investigate a system of twelve quaternion matrix equations. Using the real representation matrix, first derive least-squares solution with least norm to system. Meanwhile, establish solvability conditions and an expression general when it is consistent.
منابع مشابه
existence and approximate $l^{p}$ and continuous solution of nonlinear integral equations of the hammerstein and volterra types
بسیاری از پدیده ها در جهان ما اساساً غیرخطی هستند، و توسط معادلات غیرخطی بیان شده اند. از آنجا که ظهور کامپیوترهای رقمی با عملکرد بالا، حل مسایل خطی را آسان تر می کند. با این حال، به طور کلی به دست آوردن جوابهای دقیق از مسایل غیرخطی دشوار است. روش عددی، به طور کلی محاسبه پیچیده مسایل غیرخطی را اداره می کند. با این حال، دادن نقاط به یک منحنی و به دست آوردن منحنی کامل که اغلب پرهزینه و ...
15 صفحه اولRanks of the common solution to some quaternion matrix equations with applications
We derive the formulas of the maximal andminimal ranks of four real matrices $X_{1},X_{2},X_{3}$ and $X_{4}$in common solution $X=X_{1}+X_{2}i+X_{3}j+X_{4}k$ to quaternionmatrix equations $A_{1}X=C_{1},XB_{2}=C_{2},A_{3}XB_{3}=C_{3}$. Asapplications, we establish necessary and sufficient conditions forthe existence of the common real and complex solutions to the matrixequations. We give the exp...
متن کاملjohn steinbeck: friend of the american common man
in his last years of life americans had almost forgotton steinbeck, and those who had not, occasionally criticized him for supporting and praising the u. s. military intervention in the vietnam war. althought ateinbeck incorporates different themes into his works, each one bears many signs of his concern and sympathy for america and the american common people in particular. steinbecks to a god ...
15 صفحه اولOn the numerical solution of generalized Sylvester matrix equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection metho...
متن کاملdeterminant of the hankel matrix with binomial entries
abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2022
ISSN: ['2406-0933', '0354-5180']
DOI: https://doi.org/10.2298/fil2203887y